Dynamic Sorted Neighborhood Indexing for Real-Time Entity Resolution
نویسندگان
چکیده
منابع مشابه
Dynamic Similarity-Aware Inverted Indexing for Real-Time Entity Resolution
Entity resolution is the process of identifying groups of records in a single or multiple data sources that represent the same real-world entity. It is an important tool in data de-duplication, in linking records across databases, and in matching query records against a database of existing entities. Most existing entity resolution techniques complete the resolution process offline and on stati...
متن کاملA Dynamic Indexing for Incremental Entity Resolution over Query Results
Entity Resolution (ER) is the problem of identifying groups of tuples from one or multiple data sources that represent the same real-world entity. This is a crucial stage of data integration processes, which often need to integrate data at query time. This task becomes more challenging in scenarios with dynamic data sources or with a large volume of data. As most ER techniques deal with all tup...
متن کاملEntity Resolution with Heavy Indexing
Entity resolution (ER), or deduplication is a computationally hard problem with O(n) time complexity. We reformulate ER as a search problem, and develop algorithms using efficient indices. Indices can enhance algorithm scalability, facilitate distributed processing, but require additional storage space. We study the performance and tradeoffs between index update and search in ER algorithms, and...
متن کاملA real-time recursive dynamic model for vehicle driving simulators
This paper presents the Real-Time Recursive Dynamics (RTRD) model that is developed for driving simulators. The model could be implemented in the Driving Simulator. The RTRD can also be used for off-line high-speed dynamics analysis, compared with commercial multibody dynamics codes, to speed up mechanical design process. An overview of RTRD is presented in the paper. Basic models for specific ...
متن کاملSorted Neighborhood for the Semantic Web
Entity Resolution (ER) concerns identifying logically equivalent entity pairs across databases. To avoid Θ(n) pairwise comparisons of n entities, blocking methods are used. Sorted Neighborhood is an established blocking method for relational databases. It has not been applied on graph-based data models such as the Resource Description Framework (RDF). This poster presents a modular workflow for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Data and Information Quality
سال: 2015
ISSN: 1936-1955,1936-1963
DOI: 10.1145/2816821